Alliances and negotiations

Alliances and negotiations

Interpartner negotiations in alliances: a strategic framework

Purpose – The purpose of this paper is propose a strategic framework for understanding interpartner negotiation dynamics in alliances. Design/methodology/approach – The authors define interpartner negotiations as a process of reconciling and integrating the interests of the partners in an alliance, and consider four types of interpartner negotiation strategies – problem solving, contending, yie...

On defensive alliances and strong global offensive alliances

We consider complexity issues and upper bounds for defensive alliances and strong global offensive alliances in graphs. We prove that it is NP-complete to decide for a given 6-regular graph G and a given integer a, whether G contains a defensive alliance of order at most a. Furthermore, we prove that determining the strong global offensive alliance number γô(G) of a graph G is APX-hard for cubi...

Strong Alliances in Graphs

For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...

Alliances: Sanctioning and Monitoring